Fast Fourier Transform for Discrete Asian Options
نویسنده
چکیده
This paper presents an efficient methodology for the discrete Asian options consistent with different types of underlying densities, especially non-normal returns as suggested by the empirical literature (Mandelbrot (1963) and Fama (1965)). The interest of this method is its flexibility compared to the more standard ones. Based on Fast Fourier Transform, the method is an enhanced version of the algorithm of Caverhill and Clewlow (1992). The contribution of this paper is to improve their algorithm and to adapt it to non-lognormal densities. This enables us to examine the impact of fattailed distributions on price as well as on delta. We find evidence that fat tails lead to wider jumps in the delta.
منابع مشابه
Option pricing under the double stochastic volatility with double jump model
In this paper, we deal with the pricing of power options when the dynamics of the risky underling asset follows the double stochastic volatility with double jump model. We prove efficiency of our considered model by fast Fourier transform method, Monte Carlo simulation and numerical results using power call options i.e. Monte Carlo simulation and numerical results show that the fast Fourier tra...
متن کاملFast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options
This paper develops three polynomial-time pricing techniques for European Asian options with provably small errors, where the stock prices follow binomial trees or trees of higher-degree. The first technique is the first known Monte Carlo algorithm with analytical error bounds suitable for pricing single-stock options with meaningful confidence and speed. The second technique is a general recur...
متن کاملFast Fourier Transform Processors: Implementing FFT and IFFT Cores for OFDM Communication Systems
The terms Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) are used to denote efficient and fast algorithms to compute the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) respectively. The FFT/IFFT is widely used in many digital signal processing applications and the efficient implementation of the FFT/IFFT is a topic of continuous research.
متن کاملDetermination of Riboflavin by Nanocomposite Modified Carbon Paste Electrode in Biological Fluids Using Fast Fourier Transform Square Wave Voltammetry
Herein, fast Fourier transformation square-wave voltammetry (FFT-SWV) as a novel electrochemical determination technique was used to investigate the electrochemical behavior and determination of Riboflavin at the surface of a nanocomposite modified carbon paste electrode. The carbon paste electrode was modified by nanocomposite containing Samarium oxide (Sm2O3)/reduced gra...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کامل